On a many server queue with non-recurrent input and negative exponential servers
نویسندگان
چکیده
منابع مشابه
Scheduling a Multi Class Queue with Many Exponential Servers : Asymptotic Optimality in Heavy Traffic
We consider the problem of scheduling a queueing system in which many statistically identical servers cater to several classes of impatient customers. Service times and impatience clocks are exponential while arrival processes are renewal. Our cost is an expected cumulative discounted function, linear or nonlinear, of appropriately normalized performance measures. As a special case, the cost pe...
متن کاملMany-Server Fluid Queue with Abandonment
We consider the Gt/Mt/st + GIt many-server fluid queue with time-varying parameters, intended as an approximation for the corresponding stochastic queueing model, having general arrival process (the Gt), Markovian service (the Mt) and customer abandonment with mutually independent times to abandon with a general distribution (the +GIt) when there are many servers (the st) and the system experie...
متن کاملGIt Many-Server Fluid Queue
We determine the time-dependent performance of a deterministic fluid model that approximates the many-server Gt/GI/st + GI queueing model. The model has a time-varying arrival rate and service capacity, abandonment from queue, and non-exponential service and patience distributions. Our key assumptions are that (i) the system alternates between overloaded and underloaded intervals, and (ii) the ...
متن کاملQueue with Heterogeneous Server Under Resequencing Constraint
In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.?
متن کاملM m m Queue with Balking, Reneging and Additional Servers
In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1968
ISSN: 0004-9735
DOI: 10.1017/s1446788700006522